Parallel solution of certain Toeplitz least-squares problems
نویسندگان
چکیده
منابع مشابه
Solving the block-Toeplitz least-squares problem in parallel
In this paper we present two versions of a parallel algorithm to solve the block–Toeplitz least-squares problem on distributed-memory architectures. We derive a parallel algorithm based on the seminormal equations arising from the triangular decomposition of the product T TT . Our parallel algorithm exploits the displacement structure of the Toeplitz-likematrices using theGeneralized SchurAlgor...
متن کاملPreconditioned Iterative Methods for Weighted Toeplitz Least Squares Problems
We consider the iterative solution of weighted Toeplitz least squares problems. Our approach is based on an augmented system formulation. We focus our attention on two types of preconditioners: a variant of constraint preconditioning, and the Hermitian/skew-Hermitian splitting (HSS) preconditioner. Bounds on the eigenvalues of the preconditioned matrices are given in terms of problem and algori...
متن کاملDisplacement Preconditioner for Toeplitz Least Squares Iterations
We consider the solution of least squares problems min ||b − Ax||2 by the preconditioned conjugate gradient (PCG) method, for m × n complex Toeplitz matrices A of rank n. A circulant preconditioner C is derived using the T. Chan optimal preconditioner for n × n matrices using the displacement representation of AA. This allows the fast Fourier transform (FFT) to be used throughout the computatio...
متن کاملA Total Least Squares Methodfor Toeplitz
A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...
متن کاملBlock-Toeplitz/Hankel Structured Total Least Squares
A structured total least squares problem is considered in which the extended data matrix is partitioned into blocks and each of the blocks is block-Toeplitz/Hankel structured, unstructured, or exact. An equivalent optimization problem is derived and its properties are established. The special structure of the equivalent problem enables us to improve the computational efficiency of the numerical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1986
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90161-8